Systems defense games: Colonel blotto, command and control

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Colonel Blotto and General Lotto games

A class of integer-valued allocation games—“General Lotto games”—is introduced and solved. The results are then applied to analyze the classical discrete “Colonel Blotto games”; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.

متن کامل

An experimental investigation of colonel blotto games

This article examines behavior in the Colonel Blotto game with asymmetric forces. In this constant-sum game, two players simultaneously allocate their forces across n-battlefields, with the objective of maximizing the expected number of battlefields won. The experimental results support all major theoretical predictions. In the auction treatment, where winning a battlefield is deterministic, th...

متن کامل

Generalizations of the General Lotto and Colonel Blotto Games∗

In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium in the ge...

متن کامل

Generalized Colonel Blotto Game

Competitive resource allocation between adversarial decision makers arises in a wide spectrum of realworld applications such as in communication systems, cyberphysical systems security, as well as financial, political, and electoral competition. As such, developing analytical tools to model and analyze competitive resource allocation is crucial for devising optimal allocation strategies and ant...

متن کامل

A Colonel Blotto Gladiator Game

We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators’ strengths. Each team’s strategy consist the allocation of its total strength among its gladiators. We find the Nash equilibria and the val...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Naval Research Logistics Quarterly

سال: 1981

ISSN: 0028-1441,1931-9193

DOI: 10.1002/nav.3800280210